Guaranteed Message Latencies for Distributed Safety-critical Hard Real-time Control Networks1
نویسندگان
چکیده
Analysis is presented that enables the worst case latencies for Controller Area Network (CAN) messages to be predicted. The analysis is illustrated in terms of the Intel 82527 controller and applied to a SAE benchmark. This benchmark contains some 53 message types; all of which are analysed for various transmission rates. Techniques are presented that enables the temporal behaviour of a CAN system to be improved. In particular the impact of message “piggybacking” is assessed. The paper concludes by considering error recovery, and presents a framework into which different failure models can be incorporated and analysed (in terms of the impact failures have on message latencies).
منابع مشابه
A Symmetric MAC Protocol for CSMA Busses in Dynamic Distributed Real-time Systems
By using a hybrid scheduling algorithm consisting of static offline scheduling and dynamic online scheduling, hard deadlines can be guaranteed, while achieving optimal resource utilization by soft real-time activities. This paper introduces a medium access control (MAC) protocol for a CSMA bus, which supports the hybrid scheduling of hard and soft real-time messages on the bus. The key issues c...
متن کاملProbabilistic Timing Analysis of Distributed Real-time Automotive Systems
Probabilistic Timing Analysis of Distributed Real-time Automotive Systems by Haibo Zeng Doctor of Philosophy in Engineering-Electrical Engineering and Computer Sciences University of California, Berkeley Professor Alberto L. Sangiovanni-Vincentelli, Chair Distributed architectures supporting the execution of real-time applications are common in automotive systems. Many applications, including m...
متن کامل1 Adaptive Protocols for Survivability of Transactions Operating on Replicated Objects
We present a novel transaction model for distributed safety-critical real-time applications in which transactions become increasingly critical under failures of subsequent incarnations. When a transaction-dependent criticality threshold has been reached the transaction is considered essentially critical or hard, i.e. the deadline has to be met lest the system is doomed to be in a disastrous sta...
متن کاملHard Real - Time Communication inMultiple - Access
With the increasing use of distributed hard real-time systems, the ability of computer networks to handle hard real-time message traac is becoming more important. For traditional networks, maximizing the throughput or minimizing the average message delay is the most important performance criteria. In the hard real-time domain, however, concern focuses on satisfying the time constraints of indiv...
متن کامل1 Adaptive Concurrency Control in Distributed Real - Time Systems
We present a novel transaction model for distributed safety-critical real-time applications. Transactions become increasingly critical under failures of subsequent incarnations. When a transaction-dependent criticality threshold has been reached the transaction is considered essentially critical or hard, i.e. the deadline has to be met lest the system is doomed to be in a disastrous state. The ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994